On Location and Approximation of Clusters of Zeros of Analytic Functions
نویسندگان
چکیده
In the beginning of the eighties, M. Shub and S. Smale developed a quantitative analysis of Newton’s method for multivariate analytic maps. In particular, their α-theory gives an effective criterion that ensures safe convergence to a simple isolated zero. This criterion requires only information concerning the map at the initial point of the iteration. Generalizing this theory to multiple zeros and clusters of zeros is still a challenging problem. In this article we focus on one complex variable functions. We study general criteria for detecting clusters and analyze the convergence of Schröder’s iteration to a cluster. In the case of a multiple root, it is well-known that this convergence is quadratic. In the case of a cluster with positive diameter, the convergence is still quadratic provided the iteration is stopped sufficiently early. We propose a criterion for stopping this iteration at a distance from the cluster which is of the order of its diameter.
منابع مشابه
On Location and Approximation of Clusters of Zeros: Case of Embedding Dimension One
Isolated multiple zeros or clusters of zeros of analytic maps with several variables are known to be difficult to locate and approximate. This article is in the vein of the α-theory, initiated by M. Shub and S. Smale in the beginning of the eighties. This theory restricts to simple zeros, i.e., where the map has corank zero. In this article we deal with situations where the analytic map has cor...
متن کاملOn locating clusters of zeros of analytic functions
Given an analytic function f and a Jordan curve γ that does not pass through any zero of f , we consider the problem of computing all the zeros of f that lie inside γ, together with their respective multiplicities. Our principal means of obtaining information about the location of these zeros is a certain symmetric bilinear form that can be evaluated via numerical integration along γ. If f has ...
متن کاملConvergence theorems of iterative approximation for finding zeros of accretive operator and fixed points problems
In this paper we propose and studied a new composite iterative scheme with certain control con-ditions for viscosity approximation for a zero of accretive operator and xed points problems in areflexive Banach space with weakly continuous duality mapping. Strong convergence of the sequencefxng dened by the new introduced iterative sequence is proved. The main results improve andcomplement the co...
متن کاملError analysis of a derivative-free algorithm for computing zeros of analytic functions
We consider the quadrature method developed by Kravanja and Van Barel (Computing 63(1):69–91, 1999) for computing all the zeros of an analytic function that lie inside the unit circle. The algorithm uses only the function values and no (first or higher order) derivatives. Information about the location of the zeros is obtained from certain integrals along the unit circle. In numerical computati...
متن کاملNumerical analysis of a bisection-exclusion method to find zeros of univariate analytic functions
We state precise results on the complexity of a classical bisectionexclusion method to locate zeros of univariate analytic functions contained in a square. The output of this algorithm is a list of squares containing all the zeros. It is also a robust method to locate clusters of zeros. We show that the global complexity depends on the following quantities: the size of the square, the desired p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Foundations of Computational Mathematics
دوره 5 شماره
صفحات -
تاریخ انتشار 2005